An enhanced primal-simplex based Tardos’ algorithm
نویسندگان
چکیده
The authors recently proposed a simplex-based Tardos’ algorithm which is strongly polynomial if the coefficient matrix is totally unimodular and the auxiliary problems are non-degenerate. Motivated by the algorithmic practically of such methods, we introduce a modification which circumvents the determination of the largest sub-determinant while keeping the same theoretical performance. Assuming the coefficient matrix is integer and non-degeneracy, the proposed algorithm is polynomial in the dimension of the input data and the maximum absolute value of a sub-determinant of the coefficient matrix.
منابع مشابه
A primal-simplex based Tardos' algorithm
In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded in the dimension of the input. Combining Orlin’s primal-basedmodification andMizuno’s use of the simplex method, we introduce a modification of Tardos’ algorithm considering only the primal problem and using the simplex ...
متن کاملSolving fully fuzzy Linear Programming Problem using Breaking Points
Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...
متن کاملA new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming
Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کامل